Assessing solution quality of biobjective 0-1 knapsack problem using evolutionary and heuristic algorithms
نویسندگان
چکیده
Multiobjective 0-1 knapsack problem involving multiple knapsacks is a widely studied problem. In this paper, we consider a formulation of the biobjective 0-1 knapsack problem which involves a single knapsack; this formulation ismore realistic and hasmany industrial applications. Though it is formulated using simple linear functions, it is an NP-hard problem. We consider three different types of knapsack instances, where the weight and profit of an item is (i) uncorrelated, (ii) weakly correlated, and (iii) strongly correlated, to obtain generalized results. First, we solve this problem using three well-known multiobjective evolutionary algorithms (MOEAs) and quantify the obtained solution-fronts to observe that they show good diversity and (local) convergence. Then, we consider two heuristics and observe that the quality of solutions obtained by MOEAs is much inferior in terms of the extent of the solution space. Interestingly, none of the MOEAs could yield the entire coverage of the Pareto-front. Therefore, based on the knowledge of the Pareto-front obtained from the heuristics, we incorporate problemspecific knowledge in the initial population and obtain good quality solutions using MOEAs too. We quantify the obtained solution fronts for comparison. The main point we stress with this work is that, for real world applications of unknown nature, it is indeed difficult to realize how good/bad is the quality of the solutions obtained. Conversely, if we know the solution space, it is trivial to obtain the desired set of solutions using MOEAs, which is a paradox in itself. 2009 Elsevier B.V. All rights reserved. * Corresponding author. E-mail address: [email protected] (R. Kumar).
منابع مشابه
Balanced Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem
0/1 Multiple Knapsack Problem, a generalization of more popular 0/1 Knapsack Problem, is NP-hard and considered harder than simple Knapsack Problem. 0/1 Multiple Knapsack Problem has many applications in disciplines related to computer science and operations research. Quantum Inspired Evolutionary Algorithms (QIEAs), a subclass of Evolutionary algorithms, are considered effective to solve diffi...
متن کاملMEDACO: Solving Multiobjective Combinatorial Optimization with Evolution, Decomposition and Ant Colonies
We propose a novel multiobjective evolutionary algorithm, MEDACO, a shorter acronym for MOEA/D-ACO, combining ant colony optimization (ACO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D). The motivation is to use the online-learning capabilities of ACO, according to the Reactive Search Optimization (RSO) paradigm of ”learning while optimizing”, to further improve the ...
متن کاملUsing ACO in MOEA/D for Multiobjective Combinatorial Optimization
Combining ant colony optimization (ACO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D), this paper proposes a multiobjective evolutionary algorithm, MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes an multiobjective optimization problem into a number of single objective optimization problems. Each ant (i.e. agent) is responsible for solving on...
متن کاملMultiobjective Combinatorial Optimization by Using Decomposition and Ant Colony
Combining ant colony optimization (ACO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D), this paper proposes a multiobjective evolutionary algorithm, MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes a multiobjective optimization problem into a number of single objective optimization problems. Each ant (i.e. agent) is responsible for solving one...
متن کاملThe Application of Computerized Algorithms in the Design Method of Software-hardware Dual-track Partitioning in an Embedded System Abstract
It has been proved that the hardware/software partitioning problem is NP-hard. Currently we have tried a variety of computerized algorithms to resolve it, which can be divided into two major categories: accurate algorithms and heuristic algorithms. This paper will discuss accurate algorithms and heuristic algorithms respectively. Accurate algorithms take the example of a greedy algorithm. It ab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Soft Comput.
دوره 10 شماره
صفحات -
تاریخ انتشار 2010